مساله جانمایی شبکه‌ای با در نظر گرفتن سفر چند منظوره تحت

  In this problem, there are two types of facilities and a network of nods. Facilities can only locate in nodes. There are three types of customers, two groups of which need only one type of services in a single trip, while the third group needs both types of services in a single trip. Customers in order to distance of facilities with a specified probability that related to distance, go to facilities and eliminate their needs. In order to competitors, the objective is maximize market capture for entering facilities. We use tabu search for solve this problem .